A review of the available construction methods for Golomb rulers

نویسنده

  • Konstantinos Drakakis
چکیده

We collect the main construction methods for Golomb rulers available in the literature along with their proofs. In particular, we demonstrate that the Bose-Chowla method yields Golomb rulers that appear as the main diagonal of a special subfamily of Golomb Costas arrays. We also show that Golomb rulers can be composed to yield longer Golomb rulers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic Aspects of Golomb Ruler Construction

We consider Golomb rulers and their construction. Common rulers feature marks at every unit measure, distances can often be measured with numerous pairs of marks. On Golomb rulers, for every distance there are at most two marks measuring it. The construction of optimal—with respect to shortest length for given number of marks or maximum number of marks for given length—is nontrivial, various pr...

متن کامل

On the complexity of constructing Golomb Rulers

AGolombRuler is a rulerwith integermarkswhere the distances between every twomarks are distinct. Golomb Rulers find diverse applications in computer science and electrical engineering. According to our knowledge the computational complexity of problems related to the construction of Golomb Rulers is unknown. We provide natural definitions for problems related to the construction of such rulers....

متن کامل

On the Construction of Nearly Optimal Golomb Rulers by Unwrapping Costas Arrays

We show that stacking the columns of a Costas array one below the other yields a Golomb ruler, provided several blank rows have been appended at the bottom of the array first, and we prove rigorously an upper bound for the necessary number of rows. We then provide a method to determine the numbers of blank rows appended for which the construction succeeds, and we also determine by simulation th...

متن کامل

Evolving the Maximum Segment Length of a Golomb Ruler

An evolutionary algorithm based on Random Keys to represent Golomb Rulers segments has been found to be a reliable option for finding Optimal Golomb Rulers in a short amount of time, when comparing with standard methods. This paper presents a modified version of this evolutionary algorithm where the maximum segment length for a Golomb Ruler is also part of the evolutionary process. Attained exp...

متن کامل

Constructing Optimal Golomb Rulers in Parallel

In this paper, a construction of the Golomb optimal rulers is studied with a tree search approach. Improvements to the basic algorithm are given and it is parallelized using a shared memory. The application associated to this approach is written in C using the standard OpenMP and MPI libraries. The algorithm takes advantage of a collaboration mechanism between the processors. Different load bal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adv. in Math. of Comm.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2009